Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(x, g(x)) → x
f(x, h(y)) → f(h(x), y)
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
f(x, g(x)) → x
f(x, h(y)) → f(h(x), y)
Q is empty.
We use [23] with the following order to prove termination.
Lexicographic path order with status [19].
Quasi-Precedence:
f2 > h1
g1 > h1
Status: h1: [1]
f2: [2,1]
g1: multiset